package jianzhiOffer;
//剑指 Offer 47. 礼物的最大价值
public class Num47_maxValue {
    public int maxValue(int[][] grid) {
        int row = grid.length;
        int col = grid[0].length;
        int[][]dp = new int[row + 1][col + 1];
        dp[0][0] = grid[0][0];
        for (int i = 1; i <= row; i++) {
            for (int j = 1; j <= col; j++) {
                dp[i][j] = Math.max(dp[i - 1][j] , dp[i][j - 1]) + grid[i - 1][j - 1];
            }
        }
        return dp[row][col];

    }
}
